A graph $G$ of order $n$ is called $k-$step Hamiltonian for $k\geq 1$ if we can label the vertices of $G$ as $v_1,v_2,\ldots,v_n$ such that $d(v_n,v_1)=d(v_i,v_{i+1})=k$ for $i=1,2,\ldots,n-1$. The (vertex) chromatic NUMBER of a graph $G$ is the minimum NUMBER of colors needed to color the vertices of $G$ so that no pair of adjacent vertices receive the same color. The clique NUMBER of $G$ is the maximum cardinality of a set of pairwise adjacent vertices in $G$. In this paper, we study the chromatic NUMBER and the clique NUMBER in $k-$step Hamiltonian graphs for $k\geq 2$. We present upper bounds for the chromatic NUMBER in $k-$step Hamiltonian graphs and give characterizations of graphs achieving the equality of the bounds. We also present an upper bound for the clique NUMBER in $k-$step Hamiltonian graphs and characterize graphs achieving equality of the bound.